Manuskripte Aus Den Instituten F Ur Betriebswirtschaftslehre Der Universit at Kiel Psplib -a Project Scheduling Problem Library

نویسنده

  • Rainer Kolisch
چکیده

We present a set of benchmark instances for the evaluation of solution procedures for singleand multi-mode resource-constrained project scheduling problems. The instances have been systematically generated by the standard project generator ProGen. They are characterized by the input-parameters of ProGen. The entire benchmark set including its detailed characterization and the best solutions known so-far are available on a public ftp-site. Hence, researchers can download the benchmark sets they need for the evaluation of their algorithms. Additionally, they can make available new results. Depending on the progress made in the eld, the instance library will be continously enlarged and new results will be made accessible. This should be a valuable and driving source for further improvements in the area of project type scheduling. 0 General Information Contact address: Rainer Kolisch / Arno Sprecher, Institut f ur Betriebswirtschaftslehre, ChristianAlbrechts-Universit at zu Kiel, Olshausenstra e 40, 24098 Kiel, Germany. The project generator ProGen, a detailed description of ProGen [17], the instance-sets, their characterizations as well as the optimal or presently best known objective function values are available on the ftp-site ftp.bwl.uni-kiel.de under the path /pub/operations-research/progen. New results, comments, and questions can be communicated to the e-mail address [email protected].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Manuskripte Aus Den Instituten F Ur Betriebswirtschaftslehre Der Universit at Kiel Minimal Delaying Alternatives and Semi-active Timetabling in Resource-constrained Project Scheduling 1

Over the years numerous branch-and-bound procedures for solving the resource-constrained project scheduling problem have been developed. Enumerating delaying alternatives, extension alternatives, feasible posets, feasible sequences or feasible subsets, they all aim at nding as fast as possible a makespan minimal schedule among the resource and precedence feasible ones. The enumeration is oftenl...

متن کامل

Manuskripte Aus Den Instituten Ff Ur Betriebswirtschaftslehre Der Universit at Kiel ' Production of Large{scale Assemblies: an Integrative Perspective 1

Since its advent, thèjust{in{time'{paradigm has considerable innu-ence on production planning and control. While originally employed for high{volume production, `just{in{time'{concepts are meanwhile documented for low{volume, make{to{order production as well. An example is the assembly of multiple customer{speciic products as recently considered by Agrawal et al. The problem has been inspired b...

متن کامل

Manuskripte Aus Den Instituten F Ur Betriebswirtschaftslehre Der Universit at Kiel Solving Multi-mode Resource-constrained Project Scheduling Problems by a Simple, General and Powerful Sequencing Algorithm. Part I: Theory

In this paper we present an exact solution procedure of the branch-and-bound type for solving the muti-mode resource-constrained project scheduling problem. The simplicity of the enumeration scheme enables a compact representation of the current state of the search process. This representation can be employed to formulate and prove search tree reduction schemes which highly increase the perform...

متن کامل

Manuskripte Aus Den Instituten F Ur Betriebswirtschaftslehre Der Universit at Kiel an Exact Algorithm for the Vehicle and Crew Scheduling Problem

We present a model for the vehicle and crew scheduling problem in urban public transport systems by combining models for vehicle and crew scheduling that cover a great variety of real world aspects, especially constraints for crews resulting from wage agreements and internal regulations. The main part of the model consists of a set partitioning formulation to cover the desired trips of the sche...

متن کامل

Manuskripte Aus Den Instituten F Ur Betriebswirtschaftslehre Der Universit at Kiel Solving Multi-mode Resource-constrained Project Scheduling Problems by a Simple, General and Powerful Sequencing Algorithm. Part Ii: Computation

This is the second part of a paper considering the multi-mode resource-constrained project scheduling problem. The rst part presents an exact solution procedure for solving several variants of the multi-mode resource-constrained project scheduling problem including the commonly known makespan minimization problem. The basic scheme is enhanced by powerful search tree reduction schemes considerab...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996